Digitized circular arcs: characterization and parameter estimation
نویسندگان
چکیده
منابع مشابه
Digitized Circular Arcs: Characterization and Parameter Estimation
The digitization of a circular arc causes an inherent loss of geometrical information. Arcs with slightly different local curvature or position may lead to exactly the same digital pattern. In this paper we give a characterization of all centers and radii of circular arcs yielding the same digitization pattern. The radius of the arcs varies over the set. However, only one curvature or radius es...
متن کاملRobust Radial Distortion Estimation Using Good Circular Arcs
It is a common problem, radial distortion of off-theshelf cameras, especially those low-cost ones and wide-angle ones. And the most direct method to judge whether radial distortion occurs in an image is the straightness of those lines in the image, for the straight line in the image should be straight in the ideal image under the pin-hole camera model. In this paper, we present a new line-based...
متن کاملTriangulations with Circular Arcs
An important objective in the choice of a triangulation is that the smallest angle becomes as large as possible. In the straight line case, it is known that the Delaunay triangulation is optimal in this respect. We propose and study the concept of a circular arc triangulation— a simple and effective alternative that offers flexibility for additionally enlarging small angles—and discuss its appl...
متن کاملNerve Complexes of Circular Arcs
We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log n). For the particular case of the nerve complex of evenly-spaced arcs of the same length, we determine the dihedral group action on homology, and we relate th...
متن کاملContact Graphs of Circular Arcs
We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interiordisjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)-sparse if every s-vertex subgraph has at most 2s− k edges, and (2, k)-tight if in addition it has exactly 2n− k edges, where n is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 1995
ISSN: 0162-8828
DOI: 10.1109/34.387505